/* #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <ostream>
#include <sstream>
#include <string>

#define lld long long // long long 的printf 占位符是lld
#define ENDL '\n'     // 将 endl 替换为 \n 取消缓冲区
#define mod %
const long long MAX_ = 1e9;
const int MOD_N = 11;
using std::cin;
using std::cout;
using std::string;
int a[10990];
int b[109];
lld add(lld x, lld y) { return (x mod MOD_N + y mod MOD_N) mod MOD_N; }
// lld add(lld x, lld y) { return (x + y) mod MOD_N; }
lld mul(lld x, lld y) { return (x * y) mod MOD_N; }
void pre() {
  for (int i = 0; i < 18; ++i) {
    b[i] = std::pow(2, i);
    b[i] = b[i] mod MOD_N;
    // std::cout << b[i] << ENDL;
  }
}
lld cal(std::string x) {
  lld tot = 0;
  int size_ = x.size();
  for (int i = 0; i < size_; ++i) {
    if (x[i] == 'X') {
      a[i] = 10;
    } else {
      a[i] = x[i] - '0';
    }
    tot = add(tot, mul(a[i], b[i]));
  }
}
void solve() {
  std::string x;
  cin >> x;

  std::reverse(x.begin(), x.end()); // 原地反转字符串

  bool tag = false;
  lld tot = cal(x);
  // cout << tot;

  if (tot == 1) {
    cout << "------------------" << ENDL;
  } else {

    int size_ = x.size();
    for (int i = 0; i < size_; ++i) {
      // 每一位跑一遍
      if (i == 0) {
        std::string y = x;
        y[0] = 'X';
        if (cal(y) == 1) {
          cout<<
        }
      }
    }
    cout << ENDL;
  }
} */
#include <cstdio>
#include <iostream>
int main() {
  /* pre();
  int T = 1;
  cin >> T;
  while (T--) {
    solve();
  } */
  auto lambda_ = []() -> bool { return false; };
  int x = lambda_();
  std::cout << x;
}
